Hydra Games and Tree Ordinals
نویسنده
چکیده
Hydra games were introduced by Kirby and Paris, for the formulation of a result which is independent from Peano arithmetic but depends on the transfinite structure of 0. Tree ordinals are a well-known simple way to represent countable ordinals. In this paper we study the relation between these concepts; an ordinal less than 0 is canonically translated into both a hydra and a tree ordinal term, and the reduction graph of the hydra and the normal form of the term syntactically correspond to each other.
منابع مشابه
Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results
This paper is intended to give for a general mathematical audience (including non logicians) a survey about intriguing connections between analytic combinatorics and logic. We define the ordinals below ε0 in non-logical terms and we survey a selection of recent results about the analytic combinatorics of these ordinals. Using a versatile and flexible (logarithmic) compression technique we give ...
متن کاملRewriting theory for the Hydra battle and the extended Grzegorczyk hierarchy
A subrecursive rewriting framework for the classical Kirby and Paris hydra battle is introduced. The termination of a natural rewrite system RH for the Hydra battle is shown by using ordinals and additionally by proving an upper bound on the derivation lengths in terms of a fast growing function of ordinal index ε0. It is shown that the RH -derivation lengths cannot be bounded by a fast growing...
متن کاملThe Church Problem for Countable Ordinals
A fundamental theorem of Büchi and Landweber shows that the Church synthesis problem is computable. Büchi and Landweber reduced the Church Problem to problems about ω-games and used the determinacy of such games as one of the main tools to show its computability. We consider a natural generalization of the Church problem to countable ordinals and investigate games of arbitrary countable length....
متن کاملLong games on positive braids
We introduce two games played on positive braids. The first game is played on 3-strand positive braids and its termination time is Ackermannian in the input. We give an ordinal-theoretic and a model-theoretic proof (using semi-regular cuts in models of arithmetic). The second game is played on arbitrary positive braids and its termination is unprovable in IΣ2, the two-quantifier induction arith...
متن کاملAutomatic Ordinals
We prove that the injectively ω-tree-automatic ordinals are the ordinals smaller than ω ω . Then we show that the injectively ωautomatic ordinals, where n ≥ 1 is an integer, are the ordinals smaller than ω n . This strengthens a recent result of Schlicht and Stephan who considered in [SS11] the subclasses of finite word ω-automatic ordinals. As a by-product we obtain that the hierarchy of injec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007